Monopolar graphs: Complexity of computing classical graph parameters

Applications of some Graph Operations in Computing some Invariants of Chemical Graphs

In this paper, we first collect the earlier results about some graph operations and then we present applications of these results in working with chemical graphs.

Computing Szeged index of graphs on ‎triples

ABSTRACT Let ‎G=(V,E) ‎be a‎ ‎simple ‎connected ‎graph ‎with ‎vertex ‎set ‎V‎‎‎ ‎and ‎edge ‎set ‎‎‎E. ‎The Szeged index ‎of ‎‎G is defined by ‎ where ‎ respectively ‎ ‎ is the number of vertices of ‎G ‎closer to ‎u‎ (‎‎respectively v)‎ ‎‎than ‎‎‎v (‎‎respectively u‎).‎ ‎‎If ‎‎‎‎S ‎is a‎ ‎set ‎of ‎size‎ ‎ ‎ ‎let ‎‎V ‎be ‎the ‎set ‎of ‎all ‎subsets ‎of ‎‎S ‎of ‎size ‎3. ‎Then ‎we ‎define ‎t...

Graph Convexity Parameters: Complexity and Applications

Computing GA4 Index of Some Graph Operations

The geometric-arithmetic index is another topological index was defined as 2 deg ( )deg ( ) ( ) deg ( ) deg ( ) G G uv E G G u v GA G u v     , in which degree of vertex u denoted by degG (u). We now define a new version of GA index as 4 ( ) 2 ε ( )ε ( ) ( ) ε ( ) ε ( ) G G e uv E G G G u v GA G   u v    , where εG(u) is the eccentricity of vertex u. In this paper we compute this new t...

applications of some graph operations in computing some invariants of chemical graphs

in this paper, we first collect the earlier results about some graph operations and then wepresent applications of these results in working with chemical graphs.